package LeetCode精选TOP面试题;

public class p62不同路径 {
    public int uniquePaths(int m, int n) {
        //动态规划
        int[][] dp=new int[m][n];
        //边界处理
        for (int i = 0; i <n ; i++) {
            dp[0][i]=1;
        }
        for (int i = 0; i <m ; i++) {
            dp[i][0]=1;
        }

        //动态方程：dp[i][j]=dp[i-1][j]+dp[i][j-1]
        for (int i = 1; i <m; i++) {
            for (int j = 1; j <n ; j++) {
                dp[i][j]=dp[i-1][j]+dp[i][j-1];
            }
        }
        return dp[m-1][n-1];
    }


}
